package com.example.algorithm.tree.heap.priorityQueue;

public class MinPriorityQueueTest {
    public static void main(String[] args) {
        MinPriorityQueue<String> queue = new MinPriorityQueue<String>(10);
        queue.insert("A");
        queue.insert("D");
        queue.insert("G");
        queue.insert("B");
        queue.insert("E");
        queue.insert("F");
        queue.insert("C");


        while (!queue.isEmpty()) {
            System.out.println(queue.delMin());
        }
    }
}
